Beowulf Cluster- PXSMAlg Parallel Exact String-Matching Algorithm

Derivation of a parallel string matching algorithm

We derive an efficient parallel algorithm to find all occurrences of a pattern string in a subject string in O(log n) time, where n is the length of the subject string. The number of processors employed is of the order of the product of the two string lengths. The theory of powerlists [2, 3] is central to the development of the algorithm and its algebraic manipulations.

Parallel String Matching Algorithm Using Grid

Grid computing provides solutions for various complex problems. Implementing computing intensive applications such as string matching problem on grid is inevitable. In this paper we present a new method for exact string matching based on grid computing. The function of the grid is to parallelize the string matching problem using grid MPI parallel programming method or loosely coupled parallel s...

Sequential Exact String Matching

KSIX Parallel Environment for Beowulf Cluster

Fast Parallel Image Matching Algorithm on Cluster

This paper introduces our experiences with developing fast Parallel stereo matching algorithm on Cluster. The key technique of generating DEMs or DSMs’ from remote-sensing images is stereo matching, and it’s one of the most time consuming algorithms, so that many efforts have been carried out to develop fast algorithms. Many difficulty problems continue to challenge researchers in this field; t...